Efficient Low Computational Complexity Technique for Burst Error Reduction in Wimax Networks

In this paper, efficient techniques are presented for reducing the mobility bad effects with enhancing the complexity. It proposes the chaotic interleaver algorithm for the convolutional codes with the Viterbi decoding is presented. The presented interleaver is based on chaotic Baker map. It is applied with the (2,1,3) convolutional codes and compared with the (2,1,7) convolutional codes. The proposed interleaver is applied to different bits stream lengths of 1024, 2048, 4096, 8192, and 16384 bits. The simulation results show the superiority of the proposed chaotic interleaving scheme over the traditional schemes in the image transmission over the mobile channels. Also, the chaotic interleaver performs better with the packet length increasing. The chaotic interleaver enhances the security with the different secret key for every transmitted packet. The computer simulations are carried out using the widely accepted Jakes’ model. The results reveal that the proposed scenarios can be applied to the long bit stream packet technologies such as Wimax. Keywords– Burst Error, Wimax, Chaotic interleaver.